Analyzing Markov Chains Based on Kronecker Products

نویسنده

  • Tuǧrul Dayar
چکیده

Kronecker products are used to define the underlying Markov chain (MC) in various modeling formalisms, including compositional Markovian models, hierarchical Markovian models, and stochastic process algebras. The motivation behind using a Kronecker structured representation rather than a flat one is to alleviate the storage requirements associated with the MC. With this approach, systems that are an order of magnitude larger can be analyzed on the same platform. The developments in the solution of such MCs are reviewed from an algebraic point of view and possible areas for further research are indicated with an emphasis on preprocessing using reordering, grouping, and lumping and numerical analysis using block iterative, multilevel, and preconditioned projection methods.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Decompositional Analysis of Kronecker Structured Markov Chains

This contribution proposes a decompositional iterative method for the steadystate analysis of Kronecker structured Markov chains [1]. The Markovian system, which is formed by a composition of subsystems using the Kronecker sum operator for local transitions and the Kronecker product operator for synchronized transitions, is assumed to have irreducible subsystem matrices associated with local tr...

متن کامل

Advances in compositional approaches based on Kronecker algebra: Application to the study of manufacturing systems

Recent developments in the use of Kronecker algebra for the solution of continuous-time Markov chains (CTMCs), in particular models based on stochastic Petri nets, have increased the size of the systems that can be analyzed using exact numerical methods. We report on the more recent results, and employ them to study a kanban system.

متن کامل

Restructuring tensor products to enhance the numerical solution of structured Markov chains

Kronecker descriptors are an efficient option to store the underlying Markov chain of a model in a structured and compact fashion. The basis of classical numerical solutions for Kronecker descriptors represented models is the VectorDescriptor Product (VDP). The Shuffle algorithm is the most popular VDP method to handle generalized descriptors, i.e., descriptors with functional elements. Recentl...

متن کامل

Numerical Solution of Polling Systems for Analyzing Networks on Chips

This paper introduces a numerical solution method for a class of discrete-time polling systems by relying on the power method, Kronecker matrix representations and the shuffle algorithm. The class of polling models considered consists of several infinite pseudo queues, deterministic service times, Bernoulli service and Markovian routing and includes exhaustive, 1-limited and k-limited service a...

متن کامل

Testing the Nearest Kronecker Product Preconditioner on Markov Chains and Stochastic Automata Networks

T paper is the experimental follow-up to Langville and Stewart (2002), where the theoretical background for the nearest Kronecker product (NKP) preconditioner was developed. Here we test the NKP preconditioner on both Markov chains (MCs) and stochastic automata networks (SANs). We conclude that the NKP preconditioner is not appropriate for general MCs, but is very effective for a MC stored as a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006